Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
Weighted Sum-based Genetic Algorithm for Bicriteria Network Design Problem
This paper proposes a new Multiobjective Genetic Algorithm (MOGA) approach for Bicriteria Network Design (BND) Problem. The objectives are to maximize flow and minimize cost. The proposed method adopts priority-based encoding method to represent a path in the network. Different from other encoding methods, such as path oriented encoding method, priority-based encoding method can be applied for ...
متن کاملReverse Logistics Network Problem using Priority-based Genetic Algorithm
Today, interest about the recovery of used products and materials is on increasing. Therefore, reverse logistics will become power and great potential for winning consumers in more competitive contexts in the future. This paper considers the multistage reverse Logistics Network Problem (mrLNP) with minimizing the total of costs to reverse logistics shipping cost. We will demonstrate the mrLNP m...
متن کاملMulti-objective hybrid genetic algorithm for bicriteria network design problem
This paper considers the Bicriteria Network Design Problem (bNDP) with the two conflicting objectives of minimizing cost and maximizing flow. Network design problems where even one flow measure be maximized, are often NP-hard problems. But, in real-life applications, it is often the case that the network to be built is required to optimize multi-criteria simultaneously. Thus the calculation of ...
متن کاملBicriteria real-time tasks scheduling using proportion-based genetic algorithm
Real-time systems are characterized by computational activities with timing constraints and classified into two categories: hard real-time systems and soft real-time systems. In hard real-time systems, missing deadlines can be catastrophic. However, in the case of soft real-time systems, slight violence of deadlines is not so critical. In multimedia systems, especially, continuous media is one ...
متن کاملAlgorithm robust for the bicriteria discrete optimization problem
Multiple vector optimization proposes to optimize a vector-valued function rather than a real-valued one. The motivation of that is quite natural, since most of the real-life problems involve more than one measure to be used as objective function. Multiple objective discrete optimization (MODO) problem is defined as minx∈X f(x) = [f1(x), . . . fp(x)] T , where X ⊆ R is a bounded (discrete) set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2004
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss.124.1972